Threshold arrangements and the knapsack problem
نویسندگان
چکیده
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs, threshold arrangements, and other well-studied combinatorial objects, and we correct an error in the analysis given in that paper.
منابع مشابه
An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملSolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results were prom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006